The matrix and polynomial approaches to Lanczos-type algorithms
نویسندگان
چکیده
منابع مشابه
a preemptive restarting approach to beating the inherent instability of lanczos-type algorithms
lanczos-type algorithms are well known for their inherent instability. they typically breakdown occurs when relevant orthogonal polynomials do not exist. current approaches to curing breakdown rely on jumping over the non-existent polynomials to resume computation. this may have to be used many times during the solution process. we suggest an alternative to jumping, which consists of restarting...
متن کاملextensions of some polynomial inequalities to the polar derivative
توسیع تعدادی از نامساوی های چند جمله ای در مشتق قطبی
15 صفحه اولEfficient Parallelization of Lanczos Type Algorithms
We propose a new parallelization technique for Lanzos type algorithms for solving sparse linear systems over finite fields on mesh cluster architecture. The algorithm computation time scales as P−1 on P processors, and the communication time scales as P−1/2 for reasonable choice of P .
متن کاملthe investigation of the relationship between type a and type b personalities and quality of translation
چکیده ندارد.
A Switching Approach to Avoid Breakdown in Lanczos-Type Algorithms
Lanczos-type algorithms are well known for their inherent instability. They typically breakdown when relevant orthogonal polynomials do not exist. Current approaches to avoiding breakdown rely on jumping over the non-existent polynomials to resume computation. This jumping strategy may have to be used many times during the solution process. We suggest an alternative to jumping which consists in...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational and Applied Mathematics
سال: 2000
ISSN: 0377-0427
DOI: 10.1016/s0377-0427(00)00397-6